Component synthesis from functional descriptions
نویسندگان
چکیده
منابع مشابه
Component synthesis from functional descriptions
In the literature, it is generally overlooked that designers use functional models more frequently than behavioral or gate-level models. In functional modeling, the functionality of one or more components, like arithmetic/logic units, memories, and counters, are described as separate concurrent blocks. We present an algorithm, called Functional Synthesis Algorithm (FSA), for synthesis from thes...
متن کاملHigh-Level Test Synthesis from Behavioral Descriptions
A novel full design and test generation system with combined High-Level Synthesis (HLS) and automated Hierarchical Test Pattern Generation (HTPG) was developed and experimented in cooperation between Linköping University and Tallinn Technical University. The high-level synthesis is based on an internal model of Extended Timed Petri Net (ETPN) representations. In the test generator both, registe...
متن کاملDigital Systems Synthesis from Petri Net Descriptions
The design of digital systems has reached a degree of complexity that virtually prevents their effective realization without computer aided design tools. Several languages were already proposed to be used in such tools, each with the objective of capturing as much hardware characteristic as possible. During about the last fifteen years the importance and use of Petri net as a language for model...
متن کاملComponent Synthesis from Service Specifications
Correct component models for distributed, reactive systems are difficult to construct. Typically, the services provided by such systems emerge from the interaction and collaboration of multiple components; each component, in general, contributes to multiple services. Consequently, services and their defining interaction patterns are key elements in the development process for distributed system...
متن کاملConstrained Synthesis from Component Libraries
Synthesis from component libraries is the problem of building a network of components from a given library, such that the network realizes a given specification. This problem is undecidable in general. It becomes decidable if we impose a bound on the number of chosen components. However, the bounded problem remains computationally hard and brute-force approaches do not scale. In this paper we s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 1993
ISSN: 0278-0070
DOI: 10.1109/43.240076